#include"BSTree.h"

void test()
{
	BSTree<int> B;
	int arr[] = { 5,3,4,1,7,8,2,6,0,9 };
	for (auto e : arr)
	{
		B.Insert(e);
	}
	B.inorder();
	//cout << B.Find(3) << endl;
}
int main()
{
	test();
	return 0;
}